Automatically deriving cost models for structured parallel processes using hylomorphisms
نویسندگان
چکیده
منابع مشابه
Deriving Structural Hylomorphisms From Recursive De nitions
ion, abstracting recursive function calls to derive hylomorphisms and abstracting maximal non-recursive subterms to structure hylomorphisms. A prototype of our algorithm has been implemented and tested extensively, showing its promise to be embedded in a real system. Finally, our algorithm gives the evidence that hylomorphisms can specify all recursions of interests as claimed in [BdM94].
متن کاملAutomatically deriving structured knowledge bases from on-line dictionaries1
keywords: computational lexicography; lexical knowledge bases We describe an automated strategy which exploits on-line dictionaries to construct a richly-structured lexical knowledge base. In particular, we show how the Longman Dictionary of Contemporary English (LDOCE) can be used to build a directed graph which captures semantic associations between words. The result is a huge and highly inte...
متن کاملAutomatically deriving categories for translation
An adequate approach to speech translation for small to medium sized tasks is the use of subsequential transducers —a finite state model— as language model for a speech recognizer. These transducers can be automatically trained from sample corpora. The use of manually defined categories improves the training of the subsequential transducers when the available data are scarce. These categories d...
متن کاملAutomatically deriving ODEs from process algebra models of signalling pathways
Differential equations are a classical approach for biochemical system modelling and have frequently been used to describe reactions of interest in biochemical pathways. Process algebras have also been applied in a small number of cases to describe such systems. In this paper we establish a connection between these approaches. This has the benefit of allowing process algebra models to be valida...
متن کاملAutomatically Generating CSP Models for Communicating Haskell Processes
Tools such as FDR can check whether a CSP model of an implementation is a refinement of a given CSP specification. We present a technique for generating such CSP models of Haskell implementations that use the Communicating Haskell Processes library. Our technique avoids the need for a detailed semantics of the Haskell language, and requires only minimal program annotation. The generated CSPM mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Future Generation Computer Systems
سال: 2018
ISSN: 0167-739X
DOI: 10.1016/j.future.2017.04.035